THE SIXTH JAPANESE-KOREAN JOINT CONFERENCE ON FORMAL LINGUISTICS ,1991 Unification in Unification-based Grammar
نویسندگان
چکیده
In the computational linguistics area, after Kay's adopting of feature structures and their unification to manipulate syntactic structures[KAY79], a lot of unification-based grammar formalisms have been issued such as FUG[KAY82] , LFG[BRE82] , GPSG[GAZ85] , PATRII[SHI86], HPSG[P0L87], etc.. Nowadays, an unification of feature structures is known as one of the most effective and powerful means to process linguistic information, but few practical methodologies have been introduced to implement the unification.
منابع مشابه
RUG: Regular Unification Grammar
The paper describes a new unification based grammar formalism called Regula r Unif icat ion G r a m m a r (RUG). The formalism is under development at the Research Unit of Computational Linguistics, University of Helsinki, In outline, RUG can be described as a combination of an extended graph unification formalism with a fixed minimal finite state syntax. Section I of the paper outlines the RUG...
متن کاملUnify and Merge in Fluid Construction Grammar
Research into the evolution of grammar requires that we employ formalisms and processing mechanisms that are powerful enough to handle features found in human natural languages. But the formalism needs to have some additional properties compared to those used in other linguistics research that are specifically relevant for handling the emergence and progressive co-ordination of grammars in a po...
متن کاملFeature Structures and Nonmonotonicity
Unification-based grammar formalisms use feature structures to represent linguistic knowledge. The only operation defined on feature structures, unification, is information-combining and monotonic. Several authors have proposed nonmonotonic extensions of this formalism, as for a linguistically adequate description of certain natural language phenomena some kind of default reasoning seems essent...
متن کاملParsing Korean based on Dependency Grammar and GULP
This paper presents a parsing algorithm in Prolog using GULP, based on dependency grammar and unification-based grammar.1 It parses declarative sentences of a free-word-order language, Korean. The dependency grammar accepts free order of the words in a sentence. Unification-based features separate the grammar from the parsing algorithm and also simplify the notation of the grammar. GULP (Graph ...
متن کاملUnification-Based Tree Adjoining Grammars
Many current grammar formalisms used in computational linguistics take a unification-based approach that use structures (called feature structures) containing sets of feature-value pairs. In this paper, we describe a unification-based approach to Tree Adjoining Grammars (TAG). The resulting formalism (UTAG) retains the principle of factoring dependencies and recursion that is fundamental to TAG...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006